Saturation Numbers for Trees
نویسندگان
چکیده
منابع مشابه
Saturation Numbers for Trees
For a fixed graph H, a graph G is H-saturated if there is no copy of H in G, but for any edge e 6∈ G, there is a copy of H in G + e. The collection of Hsaturated graphs of order n is denoted by SAT(n,H), and the saturation number, sat(n,H), is the minimum number of edges in a graph in SAT(n,H). Let Tk be a tree on k vertices. The saturation numbers sat(n, Tk) for some families of trees will be ...
متن کاملRamsey numbers for trees
For n ≥ 5 let T ′ n denote the unique tree on n vertices with ∆(T ′ n) = n − 2, and let T ∗ n = (V, E) be the tree on n vertices with V = {v0, v1, . . . , vn−1} and E = {v0v1, . . . , v0vn−3, vn−3vn−2, vn−2vn−1}. In this paper we evaluate the Ramsey numbers r(Gm, T ′ n) and r(Gm, T ∗ n), where Gm is a connected graph of order m. As examples, for n ≥ 8 we have r(T ′ n, T ∗ n) = r(T ∗ n , T ∗ n) ...
متن کاملSaturation Numbers of Books
A book Bp is a union of p triangles sharing one edge. This idea was extended to a generalized book Bb,p, which is the union of p copies of a Kb+1 sharing a common Kb. A graph G is called an H-saturated graph if G does not contain H as a subgraph, but G∪ {xy} contains a copy of H, for any two nonadjacent vertices x and y. The saturation number of H, denoted by sat(H,n), is the minimum number of ...
متن کاملSaturation Numbers for Nearly Complete Graphs
An upper bound on the saturation number for graphs as well as associated extremal graphs was given by (Kászonyi and Tuza in J. Graph Theory, 10:203–210, 1986). A minor improvement of that result, which was implied in their paper, will be stated. Using this result, a series of exact saturation numbers and associated extremal graphs will be proved for the nearly complete graphs Kt − E(L), where L...
متن کاملWeak saturation numbers for multiple copies
For a fixed graph F , a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F inG+e. Theminimumnumber of edges in an F-saturated graph of order nwill be denoted by sat(n, F). A graph G is weakly F-saturated if G contains no copy of F and there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/180